Adaptive Control of Strong Mutation Rate and Probability for Queen-bee Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Adaptive Control of Strong Mutation Rate and Probability for Queen-bee Genetic Algorithms
This paper introduces an adaptive control method of strong mutation rate and probability for queen-bee genetic algorithms. Although the queen-bee genetic algorithms have shown good performances, it had a critical problem that the strong mutation rate and probability should be selected by a trial and error method empirically. In order to solve this problem, we employed the measure of convergence...
متن کاملAdaptive mutation rate control schemes in genetic algorithms
Abstract The adaptation of mutation rate parameter values is important to allow the search process to optimize its performance during run time. In addition it frees the user of the need to make non-trivial decisions beforehand. Contrary to real vector coded genotypes, for discrete genotypes most users still prefer to use a fixed mutation rate. Here we propose two simple adaptive mutation rate c...
متن کاملRank-based Control of Mutation Probability for Genetic Algorithms
This paper proposes a rank-based control method of mutation probability for improving the performances of genetic algorithms (GAs). In order to improve the performances of GAs, GAs should not fall into premature convergence phenomena and should also be able to easily get out of the phenomena when GAs fall into the phenomena without destroying good individuals. For this, it is important to keep ...
متن کاملIntelligent Mutation Rate Control in Canonical Genetic Algorithms
The role of the mutation rate in canonical genetic algorithms is investigated by comparing a constant setting, a deterministically varying , time-dependent mutation rate schedule, and a self-adaptation mechanism for individual mutation rates following the principle of self-adaptation as used in evolution strategies. The power of the self-adaptation mechanism is illustrated by a time-varying opt...
متن کاملA Comparative Study of Adaptive Mutation Operators for Genetic Algorithms
Genetic algorithms (GAs) are a class of stochastic optimization methods inspired by the principles of natural evolution. Adaptation of strategy parameters and genetic operators has become an important and promising research area in GAs. Many researchers are applying adaptive techniques to guide the search of GAs toward optimum solutions. Mutation is a key component of GAs. It is a variation ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Fuzzy Logic and Intelligent Systems
سال: 2012
ISSN: 1598-2645
DOI: 10.5391/ijfis.2012.12.1.29